Nested sequent calculi and theorem proving for normal conditional logics: The theorem prover NESCOND
نویسندگان
چکیده
منابع مشابه
Nested Sequent Calculi and Theorem Proving for Normal Conditional Logics
In this paper we focus on proof methods and theorem proving for normal conditional logics, by describing nested sequent calculi as well as a theorem prover for them. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain ...
متن کاملNESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics
We present NESCOND, a theorem prover for normal conditional logics. NESCOND implements some recently introduced NESted sequent calculi for propositional CONDitional logics CK and some of its significant extensions with axioms ID, MP and CEM. It also deals with the flat fragment of CK+CSO+ID, which corresponds to the logic C introduced by Kraus, Lehmann and Magidor. NESCOND is inspired by the me...
متن کاملTableau-Based Theorem Proving In Normal Conditional Logics
This paper presents an extension of the semantic tableaux approach to theorem proving for the class of normal conditional logics. These logics are based on a possible worlds semantics, but contain a binary “variable conditional” operator =E= instead of the usual operator for necessity. The truth of A +B depends both on the accessibility relation between worlds, and on the proposition expressed ...
متن کاملProving Completeness for Nested Sequent Calculi
Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there is, going back to Lindenbaum (though not actually published by him). It has been extended to a variety of logical formalisms, sometimes combined with the addition of Henkin constants to handle quantifiers. Recently a deep-reasoning formalism called nested sequents h...
متن کاملTheorem proving for conditional logics: CondLean and GOALDUCK
In this paper we focus on theorem proving for conditional logics. First, we give a detailed description of CondLean, a theorem prover for some standard conditional logics. CondLean is a SICStus Prolog implementation of some labeled sequent calculi for conditional logics recently introduced. It is inspired to the so called “lean” methodology, even if it does not fit this style in a rigorous mann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligenza Artificiale
سال: 2015
ISSN: 1724-8035,2211-0097
DOI: 10.3233/ia-150082